Absorbing sets of homogeneous subtractive algorithms
نویسندگان
چکیده
منابع مشابه
Homogeneous and Non Homogeneous Algorithms
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non-homogeneous algorithms.1 Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously ment...
متن کاملVeriication of Ieee Compliant Subtractive Division Algorithms
A parameterized deenition of subtractive oating point division algorithms is presented and veriied using PVS. The general algorithm is proven to satisfy a formal deenition of an IEEE standard for oating point arithmetic. The utility of the general speciication is illustrated using a number of diierent instances of the general algorithm.
متن کاملVerification of IEEE Compliant Subtractive Division Algorithms
A parameterized deenition of subtractive oating point division algorithms is presented and veriied using PVS. The general algorithm is proven to satisfy a formal deenition of an IEEE standard for oating point arithmetic. The utility of the general speciication is illustrated using a number of diierent instances of the general algorithm.
متن کاملDiverse Homogeneous Sets
A set HE w is said to be diverse with respect to a partition II of w if at least two pieces of I7 have an infinite intersection with H. A family of partitions of w has the Ramsey property if, whenever Co] is two-colored, some monochromatic set is diverse with respect to at least one partition in the family. We show that no countable collection of even infinite partitions of CIJ has the Ramsey p...
متن کاملHomogeneous Sets of ATP Problems
This report describes how the homogeneity of sets of ATP problems can be measured with respect to the performance of ATP systems. Measuring homogeneity is important as a basis for empirical evaluation of ATP systems and problems. The method developed assigns problems to nodes in a graph, and finding homogeneous sets of problems is reduced to finding maximal cliques in the graph. The method is r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2012
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-012-0385-x